Performance Comparison of Parallel Implementations of Cayley and SHA Hash Functions
نویسنده
چکیده
Implementing hash functions to run on multi-core computers will reduce its running time. We aim to implement Cayley, SHA-256 and SHA-512 hash functions to run on multicore computers and compare their performances. Cayley hash compresses the input message by hashing one bit at a time using composition of linear equations. SHA-256 and SHA-512 work on message blocks and produce fixed length digest as output. We parallelize these hash functions using parallel j-lanes hashing mode. Based on our experiments, SHA-2 outperforms Cayley hash function in terms of running time. Keywords—Cayley, SHA-256, SHA-512, parallel j-lanes hashing, pj2.
منابع مشابه
Cayley Hashes: A Class of Efficient Graph-based Hash Functions
Hash functions are widely used in cryptography. Recent breakthroughs against the standard SHA-1 prompted NIST to launch a competition for a new secure hash algorithm, SHA-3 [1]. Provably secure hash functions, that is functions whose security reduces to a simply-stated, supposedly hard mathematical problem, are widely believed to be much too slow for the NIST competition. In this paper, we disc...
متن کاملParallelism Technique for Speeded-Up and Low-Powered Cryptographic Primitives
The main applications of the hash functions are met in the fields of communication integrity and signature authentication. A hash function is utilized in the security layer of every communication protocol. However, as protocols evolve and new high-performance applications appear, the throughput of most hash functions seems to reach to a limit. Furthermore, due to the tendency of the market to m...
متن کاملFPGA Implementation of CubeHash, Grøstel, JH, and SHAvite-3 Hash Functions
In this work, FPGA implementation of the compression function for four of the second round candidates of the SHA-3 competition are presented. All implementations were performed using the same technology and optimization techniques to present a fair comparison between the candidates. For our implementations we have used the Stratix III FPGA family from Altera. Achieved results are compared with ...
متن کاملPerformance Evaluation of Popular Hash Functions
This paper describes the results of an extensive study and comparison of popular hash functions SHA-1, SHA-256, RIPEMD-160 and RIPEMD-320 with JERIM-320, a 320-bit hash function. The compression functions of hash functions like SHA-1 and SHA-256 are designed using serial successive iteration whereas those like RIPEMD-160 and RIPEMD-320 are designed using two parallel lines of message processing...
متن کاملSheena Mathew , K . Poulose Jacob Performance Evaluation of Popular Hash Functions
paper describes the results of an extensive study and comparison of popular hash functions SHA-1, SHA-256, RIPEMD-160 and RIPEMD-320 with JERIM-320, a 320-bit hash function. The compression functions of hash functions like SHA-1 and SHA-256 are designed using serial successive iteration whereas those like RIPEMD-160 and RIPEMD-320 are designed using two parallel lines of message processing. JER...
متن کامل